package day_2022_7_to_8.day48;

/**
 * @author haomin
 * @date 2022/08/14 17:46
 **/
public class Day29_2_Num33_Search {
    class Solution {
        public int search(int[] nums, int target) {
            if(nums.length == 0) return -1;
            if(nums.length == 1) return nums[0] == target ? 0 : -1;

            int left = 0, right = nums.length-1, mid;
            while(left <= right){
                mid = left + (right - left)/2;
                if(nums[mid] == target) return mid;
                if(nums[0] <= nums[mid]){
                    if(nums[0] <= target && target < nums[mid]) right = mid-1;
                    else left = mid+1;
                }else {
                    if(nums[mid] < target && target <= nums[nums.length-1])
                        left = mid+1;
                    else right = mid-1;
                }
            }
            return -1;
        }
    }
}